Networking chemical robots for reaction multitasking
نویسندگان
چکیده
منابع مشابه
Chemical Networking Protocols
Beyond the mere collection of computers, a network is the home of competing and cooperating execution flows. In this paper we show how to design network protocols based on molecule-like entities such that the corresponding execution flows can by analyzed as if they were chemical processes. Our goal is to create robust protocol implementations which are resilient to unreliable execution. We intr...
متن کامل12 Chemical Robots
A wide variety of soft actuators have been studied with the progress of the intelligent materials. Especially, stimuli-responsive polymers and gels which swell or shrink in response to the environmental changes such as temperature (Hirokawa & Tanaka, 1984), electric field (Tanaka et al., 1984), light (Suzuki & Tanaka, 1990)], etc have been applied to the actuation devices. In previous decades, ...
متن کاملChemical Power for Microscopic Robots in Capillaries
UNLABELLED The power available to microscopic robots (nanorobots) that oxidize bloodstream glucose while aggregated in circumferential rings on capillary walls is evaluated with a numerical model using axial symmetry and time-averaged release of oxygen from passing red blood cells. Robots about 1 microm in size can produce up to several tens of picowatts, in steady state, if they fully use oxyg...
متن کاملChemical Master versus Chemical Langevin for First-Order Reaction Networks
Markov jump processes are widely used to model interacting species in circumstances where discreteness and stochasticity are relevant. Such models have been particularly successful in computational cell biology, and in this case, the interactions are typically first-order. The Chemical Langevin Equation is a stochastic differential equation that can be regarded as an approximation to the underl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Communications
سال: 2018
ISSN: 2041-1723
DOI: 10.1038/s41467-018-05828-8